Complete theory

Results: 1780



#Item
371NP-complete problems / Graph coloring / Graph theory / Analysis of algorithms / Complexity classes / Randomized algorithm / Distributed computing / Minimum spanning tree / SL / Theoretical computer science / Computational complexity theory / Mathematics

Towards a Complexity Theory for Local Distributed Computing⇤ Pierre Fraigniaud† Amos Korman†

Add to Reading List

Source URL: www.liafa.jussieu.fr

Language: English - Date: 2013-08-21 13:35:48
372Formal methods / Electronic design automation / Logic in computer science / NP-complete problems / Model theory / Function / Boolean satisfiability problem / Structure / Parameter / Mathematics / Theoretical computer science / Mathematical logic

Symbolic Resource Bound Inference for Functional Programs Ravichandhran Madhavan1 and Viktor Kuncak2 1 2

Add to Reading List

Source URL: lara.epfl.ch

Language: English - Date: 2014-05-24 11:45:01
373NP-complete problems / Combinatorial optimization / Graph connectivity / Matching / Maximum cut / Directed acyclic graph / Cut / Bipartite graph / Graph / Graph theory / Theoretical computer science / Mathematics

On Hardness of Pricing Items for Single-Minded Bidders∗ Rohit Khandekar Tracy Kimbrel Konstantin Makarychev

Add to Reading List

Source URL: konstantin.makarychev.net

Language: English - Date: 2014-06-08 22:16:35
374Complete / Computational complexity theory

MATH 216 PROBLEM SET 10 This problem set is due by noon on Friday, January 13. Hand in your homework to me by email. In France, families often celebrate New Year’s by gathering together and solving algebraic geometry

Add to Reading List

Source URL: math.stanford.edu

Language: English - Date: 2011-12-22 14:26:53
375NP-complete problems / Network flow / Graph coloring / Randomized algorithm / Connectivity / Flow network / Distributed computing / Modular decomposition / Belief propagation / Graph theory / Theoretical computer science / Mathematics

On the Impact of Identifiers on Local Decision? Pierre Fraigniaud1?? , Magn´ us M. Halld´orsson2? ? ? , and Amos Korman∗∗ 1 2

Add to Reading List

Source URL: www.liafa.jussieu.fr

Language: English - Date: 2012-10-01 06:03:38
376Auction theory / Auctioneering / Donation / Bid / Online shopping / Auction / Commerce / Marketing / Business / Electronic commerce / Shopping networks

Donation Form Thank you for donating an auction item to Toast for Tails! Please complete this form so we may give you the recognition you deserve. Your name will appear on our website and on the silent auction bid sheet.

Add to Reading List

Source URL: www.concernforanimals.org

Language: English - Date: 2014-06-17 15:25:03
377NP-complete problems / Combinatorial optimization / Matching / Degree / Maximum flow problem / Graph coloring / Dominating set / Mathematics / Graph theory / Theoretical computer science

Better bounds for matchings in the streaming model Michael Kapralov∗ arXiv:1206.2269v2 [cs.DS] 26 JulDecember 6, 2013

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2013-12-06 12:53:09
378Probability theory / Martingale theory / Stochastic processes / Forcing / Conditional expectation / Borel set / Ordinal number / Complete Boolean algebra / Martingale / Statistics / Mathematical logic / Mathematics

Superreplication under Volatility Uncertainty for Measurable Claims ∗ Ariel Neufeld

Add to Reading List

Source URL: www.math.columbia.edu

Language: English - Date: 2013-04-14 17:16:01
379Auction theory / Auctioneering / Business models / Auction

AUCTION EVENT SPONSORSHIP AND ADVERTISING FORM Please Complete and Return to St. Ignatius School by January 16, 2015 Auction Sponsorship Packages $5,000 – Carte Blanche (Unlimited Authority) – Preferred seating for 1

Add to Reading List

Source URL: www.stignatiusschool.org

Language: English - Date: 2015-01-13 08:58:04
380Computational complexity theory / Recreational mathematics / Z3 / Gray code / Eight queens puzzle / Sudoku / Constraint satisfaction / Bit array / Longest path problem / Mathematics / Theoretical computer science / NP-complete problems

Z3 Lab exercises Leonardo de Moura and Nikolaj Bjørner Microsoft Research, One Microsoft Way, Redmond, WA, 98074, USA {leonardo, nbjorner}@microsoft.com June 18, 2008

Add to Reading List

Source URL: leodemoura.github.io

Language: English - Date: 2015-05-19 13:22:05
UPDATE